Gates for the Kane Quantum Computer in the Presence of Dephasing

In this paper we investigate the effect of dephasing on proposed quantum gates for the solid-state Kane quantum computing architecture. Using a simple model of the decoherence, we find that the typical error in a CNOT gate is $8.3 \times 10^{-5}$. We also compute the fidelities of Z, X, Swap, and Controlled Z operations under a variety of dephasing rates. We show that these numerical results are comparable with the error threshold required for fault tolerant quantum computation.Comment: 9 pages, 9 figure

Optimising Matrix Product State Simulations of Shor's Algorithm

We detail techniques to optimise high-level classical simulations of Shor's quantum factoring algorithm. Chief among these is to examine the entangling properties of the circuit and to effectively map it across the one-dimensional structure of a matrix product state. Compared to previous approaches whose space requirements depend on $r$, the solution to the underlying order-finding problem of Shor's algorithm, our approach depends on its factors. We performed a matrix product state simulation of a 60-qubit instance of Shor's algorithm that would otherwise be infeasible to complete without an optimised entanglement mapping.Comment: 8 pages, 2 figures, 2 tables. v2 using PDFLaTeX compiler. v3 to include extra references. v4 for publication in Quantu

Robust CNOT gates from almost any interaction

There are many cases where the interaction between two qubits is not precisely known, but single qubit operations are available. In this paper we show how, regardless of an incomplete knowledge of the strength or form of the interaction between two qubits, it is often possible to construct a CNOT gate which has arbitrarily high fidelity. In particular, we show that oscillations in the strength of the exchange interaction in solid state Si and Ge structures are correctable.Comment: 5 pages, 2 figure

Comment on "Grover search with pairs of trapped ions"

In this Comment on Feng's paper [Phys. Rev. A 63, 052308 (2001)], we show that Grover's algorithm may be performed exactly using the gate set given, provided that small changes are made to the gate sequence. An analytic expression for the probability of success of Grover's algorithm for any unitary operator U instead of Hadamard gate is presented

Quantum Error Correction on Linear Nearest Neighbor Qubit Arrays

A minimal depth quantum circuit implementing 5-qubit quantum error correction in a manner optimized for a linear nearest neighbor architecture is described. The canonical decomposition is used to construct fast and simple gates that incorporate the necessary swap operations. Simulations of the circuit's performance when subjected to discrete and continuous errors are presented. The relationship between the error rate of a physical qubit and that of a logical qubit is investigated with emphasis on determining the concatenated error correction threshold.Comment: 4 pages, 5 figure

Spin-guides and spin-splitters: Waveguide analogies in one-dimensional spin chains

Here we show a direct mapping between waveguide theory and spin chain transport, opening an alternative approach to quantum information transport in the solid-state. By applying temporally varying control profiles to a spin chain, we design a virtual waveguide or 'spin-guide' to conduct individual spin excitations along defined space-time trajectories of the chain. We explicitly show that the concepts of confinement, adiabatic bend loss and beamsplitting can be mapped from optical waveguide theory to spin-guides (and hence 'spin-splitters'). Importantly, the spatial scale of applied control pulses is required to be large compared to the inter-spin spacing, and thereby allowing the design of scalable control architectures.Comment: 5 figure

Demonstration of non-Markovian process characterisation and control on a quantum processor

In the scale-up of quantum computers, the framework underpinning fault-tolerance generally relies on the strong assumption that environmental noise affecting qubit logic is uncorrelated (Markovian). However, as physical devices progress well into the complex multi-qubit regime, attention is turning to understanding the appearance and mitigation of correlated -- or non-Markovian -- noise, which poses a serious challenge to the progression of quantum technology. This error type has previously remained elusive to characterisation techniques. Here, we develop a framework for characterising non-Markovian dynamics in quantum systems and experimentally test it on multi-qubit superconducting quantum devices. Where noisy processes cannot be accounted for using standard Markovian techniques, our reconstruction predicts the behaviour of the devices with an infidelity of $10^{-3}$. Our results show this characterisation technique leads to superior quantum control and extension of coherence time by effective decoupling from the non-Markovian environment. This framework, validated by our results, is applicable to any controlled quantum device and offers a significant step towards optimal device operation and noise reduction